An Event Structure Semantics for P/T Contextual Nets: Asymmetric Event Structures
نویسندگان
چکیده
We propose an event based semantics for contextual nets, i.e. an extension of Place/Transition Petri nets where transitions can also have context conditions, modelling resources that can be read without being consumed. The result is a generalization of Winskel’s work on safe nets: the event based semantics is given at categorical level via a chain of coreflections leading from the category WS-CN of weakly safe contextual nets to the category Dom of finitary prime algebraic domains. A fundamental rôle is played by the notion of asymmetric event structures that generalize Winskel’s prime event structures, following an idea similar to that of “possible flow” introduced by Pinna and Poignè. Asymmetric event structures have the usual causal relation of traditional prime event structures, but replace the symmetric conflict with a relation modelling asymmetric conflict or weak causality. Such relation allows one to represent the new kind of dependency between events arising in contextual nets, as well as the usual symmetric conflict. Moreover it is used in a non-trivial way in the definition of the ordering of configurations, which is different from the standard set-inclusion.
منابع مشابه
Contextual Petri Nets, Asymmetric Event Structures, and Processes
We present an event structure semantics for contextual nets, an extension of P/T Petri nets where transitions can check for the presence of tokens without consuming them (read-only operations). A basic rôle is played by asymmetric event structures, a generalization of Winskel’s prime event structures where symmetric conflict is replaced by a relation modelling asymmetric conflict or weak causal...
متن کاملModelling Concurrent Computations: from Contextual Petri Nets to Graph Grammars
Graph grammars (or graph transformation systems), originally introduced as a generalization of string grammars, can be seen as a powerful formalism for the specification of concurrent and distributed systems, which properly extends Petri nets. The idea is that the state of a distributed system can be naturally represented (at a suitable level of abstraction) as a graph and local state transform...
متن کاملHistory Preserving Bisimulation for Contextual Nets
We investigate the notion of history preserving bisimulation [15, 18, 3] for contextual P/T nets, a generalization of ordinary P/T Petri nets where a transition may check for the presence of tokens without consuming them (non-destructive read operations). A first equivalence, simply called HP-bisimulation, is based on Winskel’s prime event structures. A finer equivalence, called RHP-bisimulatio...
متن کاملAn Event Structure Semantics for General Petri Nets
In this paper we address the following question: What type of event structures are suitable for representing the behaviour of general Petri nets? As a partial answer to this question we de ne a new class of event structures called local event structures and identify a subclass called UL-event structures. We propose that UL-event structures are appropriate for capturing the behaviour of general ...
متن کاملDomain and event structure semantics for Petri nets with read and inhibitor arcs
We propose a functorial concurrent semantics for Petri nets extended with read and inhibitor arcs, that we call inhibitor nets. Along the lines of the seminal work by Winskel on safe (ordinary) nets, the truly concurrent semantics is given at a categorical level via a chain of coreflections leading from the category SW-IN of semi-weighted inhibitor nets to the category Dom of finitary prime alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998